翻訳と辞書 Words near each other ・ Self-selection bias ・ Self-separation ・ Self-service ・ Self-service laundry ・ Self-service password reset ・ Self-Service Semantic Suite ・ Self-service software ・ Self-service software vendors ・ Self-serving bias ・ Self-shadowing ・ Self-shrinking generator ・ Self-signed certificate ・ Self-similar process ・ Self-similarity ・ Self-similarity matrix ・ Self-Similarity of Network Data Analysis ・ Self-siphoning beads ・ Self-stabilization ・ Self-steering gear ・ Self-stereotyping ・ Self-storage box ・ Self-Strengthening Movement ・ Self-styled orders ・ Self-sufficiency ・ Self-Sufficiency Project ・ Self-surgery ・ Self-sustainability ・ Self-synchronizing code ・ Self-tapping screw ・ Self-Taught Learner Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Self-Similarity of Network Data Analysis ： ウィキペディア英語版 Self-Similarity of Network Data Analysis In computer networks, self-similarity is a feature of network data transfer dynamics. When modeling network data dynamics the traditional time series models, such as an autoregressive moving average model (ARMA(p, q)), are not appropriate. This is because these models only provide a finite number of parameters in the model and thus interaction in a finite time window, but the network data usually have a long-range dependent temporal structure. A self-similar process is one way of modeling network data dynamics with such a long range correlation. This article defines and describes network data transfer dynamics in the context of a self-similar process. Properties of the process are shown and methods are given for graphing and estimating parameters modeling the self-similarity of network data. == Definition == Suppose $X$ be a weakly stationary (2nd-order stationary) process with mean $\backslash mu$, variance $\backslash sigma^2$, and autocorrelation function $\backslash gamma(t)$. Assume that the autocorrelation function $\backslash gamma(t)$ has the form $\backslash gamma(t)\backslash rightarrow\; t^L(t)$ as $t\backslash to\backslash infty$, where and $L(t)$ is a slowly varying function at infinity, that is $\backslash lim\_\backslash frac=1$ for all $x>0$. For example, $L(t)=const$ and $L(t)=\backslash log\; (t)$ are slowly varying functions. Let $X\_k^=\backslash frac(X\_+\backslash cdot\backslash cdot\backslash cdot+X\_)$, where $k=1,2,3,\backslash ldots$, denote an aggregated point series over non-overlapping blocks of size $m$, for each $m$ is a positive integer. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Self-Similarity of Network Data Analysis」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.